A descriptive complexity approach to the linear hierarchy
نویسندگان
چکیده
منابع مشابه
Descriptive complexity and the W hierarchy
The classes W [t] of the Downey-Fellows W hierarchy are defined, for each t, by fixed-parameter reductions to the weighted-assignment satisfiability problem for weft-t circuits. This paper proves that for each t ≥ 1, W [t] equals the closure under fixed-parameter reductions of the class of languages L definable by formulas of the form φ = (∃U)ψ, where U is a set variable and ψ is a first-order ...
متن کاملDescriptive Complexity: A Logicians Approach to Computation
structures, North Holland, 1974. [19] S. Patnaik and N. Immerman, Dyn-FO: A parallel, dynamic complexity class, ACM Symp. Principles Database Systems (1994), 210–221. [20] W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci. 4 (1970), 177–192. [21] R. Szelepcsenyi, The method of forced enumeration for nondeterministic automata, Acta I...
متن کاملA Descriptive Approach to Language-Theoretic Complexity
This interesting and original work applies descriptive complexity theory to the study of natural languages. The first part of the book (64 pages) characterizes the strong generative capacity of context-free grammars in logical terms. The second part (122 pages) discusses the generative capacity of government and binding (GB) theories. The book deserves the close attention of computational lingu...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولThe Descriptive Complexity Approach to LOGCFL
Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC and its subclasses. In the absence of the BIT predicate, we reso...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00133-6